Combinatorial Optimization and Verification in Self-Assembly
نویسنده
چکیده
Two of the most studied tile self-assembly models in the literature are the abstract Tile Assembly Model (aTAM) [7] and the Two-Handed Tile Assembly Model (2HAM) [4]. Both models constitute a mathematical model of self-assembly in which system components are four-sided Wang tiles with glue types assigned to each tile edge. Any pair of glue types are assigned some nonnegative interaction strength denoting how strongly the pair of glues bind. The models differ in their rules for growth in that the aTAM allows singleton tiles to attach one at a time to a growing seed, whereas the 2HAM permits any two previously built assemblies to combine given enough affinity for attachment. In more detail, an aTAM system is an ordered triplet .T; ; / consisting of a set of tiles T , a positive integer threshold parameter called the system’s temperature, and a special tile 2 T denoted as the seed tile. Assembly proceeds by attaching copies of tiles from T to a growing seed assembly whenever the placement of a tile on the 2D grid achieves a total strength of attachment from abutting edges, determined by the sum of pairwise glue interactions, that meets or exceeds the temperature parameter . An additional twist that is often considered is the ability to specify a relative concentration distribution on the tiles in T . The growth from the initial seed then proceeds randomly with higher concentrated tile types attaching more quickly than lower concentrated types. Even when the final assembly is deterministic, adjusting concentration profiles may substantially alter the expected time to reach the unique terminal state. The Two-Handed Tile Assembly Model (2HAM) [4] is similar to the aTAM, but removes the concept of a seed tile. Instead, a 2HAM system .T; / produces a new assembly whenever any two previously built (and potentially large) assemblies may translate together into a new stable assembly based on glue interactions and temperature. The distinction between the 2HAM and the aTAM is that the 2HAM allows large assemblies to grow independently and attach as large, pre-
منابع مشابه
Combinatorial Optimization in Pattern Assembly
Pattern self-assembly tile set synthesis (Pats) is a combinatorial optimization problem which aim at minimizing a rectilinear tile assembly system (RTAS) that uniquely self-assembles a given rectangular pattern, and is known to be NP-hard. Pats gets practically meaningful when it is parameterized by a constant c such that any given pattern is guaranteed to contain at most c colors (c-Pats). We ...
متن کاملDiamondoids and DNA Nanotechnologies
Diamondoids are cage-like saturated hydrocarbons consisting of fused cyclohexane rings. The Diamondoids family of compounds is one of the best candidates for molecular building blocks (MBBs) in nanotechnology to construct organic nanostructures compared to other MBBs known so far. The challenge is to find a route for self-assembly of these cage hydrocarbons and their applications in the bottom-...
متن کامل3D DNA self-assembly for maximum weighted independent set problem
The problem of finding a maximum weighted independent set (MWIS) is a classical combinatorial optimization problem of graph theory, which has been proved to be NP-complete (NPC). A 2-D DNA tile self-assembly model for solving the problem has been proposed previously, but it still has many deficiencies. In this paper, we will propose a 3-D DNA tile self-assembly model based on 2D DNA tile self-a...
متن کاملUnification of the a priori inconsistencies checking among assembly constraints in assembly sequence planning
Sequence planning generation is an important problem in assembly line design. A good assembly sequence can help to reduce the cost and time of the manufacturing process. This paper focuses on assembly sequence planning (ASP) known as a hard combinatorial optimization problem. Although the ASP problem has been tackled via even more sophisticated optimization techniques, these techniques are ofte...
متن کاملOptimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm
Optimization of inventory costs is the most important goal in industries. But in many models, the constraints are considered simple and relaxed. Some actual constraints are to consider the combinatorial production and purchase models in multi-products environment. The purpose of this article is to improve the efficiency of inventory management and find the economic order quantity and economic p...
متن کامل